Desynchronization Chaos Shift Keying Method Based on the Error Second derivative and its Security Analysis

This paper describes the chaos shift keying method based on the second derivative desynchronization error and provides its security analysis, especially against the attacks by power and return map analysis. Desynchronization chaos shift keying method (DECSK) uses methods to detect the correct bit by detecting the wrong bit. Various modifications are possible, here the method using sharp increase of error in the second derivative of synchronizing signal is used. The proposed method requires very reasonable amount of data to encrypt and time to decrypt one bit. Basically, to encrypt one bit, only one iteration (i.e. only one real number of six valid digits) is needed. At the same time, thanks to the desynchronization detection based on the synchronization error second derivative, almost 100% of the carrying chaotic signal can be used. The security of the proposed method can be systematically investigated showing its good resistance against typical decryption attacks. More detailed analysis is devoted to its analysis via power and return map analysis. Conclusion is that the DECSK method cannot be broken by the above two methods which together with other arguments developed there serves as a good basis for the DECSK security.